Robust Polyhedral Regularization

نویسندگان

  • Samuel Vaiter
  • Gabriel Peyré
  • Mohamed-Jalal Fadili
چکیده

In this paper, we establish robustness to noise perturbations of polyhedral regularization of linear inverse problems. We provide a sufficient condition that ensures that the polyhedral face associated to the true vector is equal to that of the recovered one. This criterion also implies that the l2 recovery error is proportional to the noise level for a range of parameter. Our criterion is expressed in terms of the hyperplanes supporting the faces of the unit polyhedral ball of the regularization. This generalizes to an arbitrary polyhedral regularization results that are known to hold for sparse synthesis and analysis l1 regularization which are encompassed in this framework. As a byproduct, we obtain recovery guarantees for l∞ and l1 − l∞ regularization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust portfolio selection with polyhedral ambiguous inputs

 Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...

متن کامل

Robust Fuzzy Content Based Regularization Technique in Super Resolution Imaging

Super-resolution (SR) aims to overcome the ill-posed conditions of image acquisition. SR facilitates scene recognition from low-resolution image(s). Generally assumes that high and low resolution images share similar intrinsic geometries. Various approaches have tried to aggregate the informative details of multiple low-resolution images into a high-resolution one. In this paper, we present a n...

متن کامل

On Robustness and Regularization of Structural Support Vector Machines

Previous analysis of binary support vector machines (SVMs) has demonstrated a deep connection between robustness to perturbations over uncertainty sets and regularization of the weights. In this paper, we explore the problem of learning robust models for structured prediction problems. We first formulate the problem of learning robust structural SVMs when there are perturbations in the sample s...

متن کامل

Multiscale Methods for Polyhedral Regularizations

In this paper we present the extension and generalization of the adaptive inverse scale space (aISS) method proposed for ` regularization in [BMBO11] to arbitrary polyhedral functions. We will see that the representation of a convex polyhedral function as a finitely generated function yields a fast and general aISS algorithm. We analyze its convergence and interpret the well known (forward) sca...

متن کامل

Weighted regularization of Maxwell equations in polyhedral domains

We present a new method of regularizing time harmonic Maxwell equations by a divergence part adapted to the geometry of the domain. This method applies to polygonal domains in two dimensions as well as to polyhedral domains in three dimensions. In the presence of reentrant corners or edges, the usual regularization is known to produce wrong solutions due the non-density of smooth fields in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1304.6033  شماره 

صفحات  -

تاریخ انتشار 2013